Orthogonal tableaux and an insertion algorithm for SO(2n + 1)
نویسنده
چکیده
A new set of tableaux indexing the weights of the irreducible representations of SO(2n + 1) is presented. These tableaux are used to produce an insertion scheme which gives a combinatorial description of the decomposition of the kth tensor power of the natural action of SO(2n + I ) into irreducibles. In particular, the multiplicities in this decomposition are described explicitly. C 1990 Academic Press. Inc.
منابع مشابه
On the Orthogonal Tableaux of Koike and Terada∗
Many different definitions have been given for semistandard odd and even orthogonal tableaux which enumerate the corresponding irreducible orthogonal characters. Weightpreserving bijections have been provided between some of these sets of tableaux (see [3], [8]). We give bijections between the (semistandard) odd orthogonal Koike-Terada tableaux and the odd orthogonal Sundaram-tableaux and betwe...
متن کاملPattern avoidance and RSK-like algorithms for alternating permutations and Young tableaux
We define a class Ln,k of permutations that generalizes alternating (up-down) permutations. We then give bijective proofs of certain pattern-avoidance results for this class. The bijections employed include are a modified form of the RSK insertion algorithm and a different bijection with RSK-like properties. As a special case of our results, we give two bijections between the set A2n(1234) of a...
متن کاملA Two-Dimensional Pictorial Presentation of Berele's Insertion Algorithm for Symplectic Tableaux
We give the first two-dimensional pictorial presentation of Berele’s correspondence [B], an analogue of the Robinson-Schensted (R-S) correspondence [Ri, Se] for the symplectic group Sp(2n,C). From the standpoint of representation theory, the R-S correspondence combinatorially describes the irreducible decomposition of the tensor powers of the natural representation of GL(n,C). Berele’s insertio...
متن کاملA Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملK-theoretic Schubert calculus for OG.n; 2nC 1/ and jeu de taquin for shifted increasing tableaux
We present a proof of a Littlewood–Richardson rule for the K-theory of odd orthogonal Grassmannians OG.n; 2n C 1/, as conjectured by Thomas–Yong (2009). Specifically, we prove that rectification using the jeu de taquin for increasing shifted tableaux introduced there, is well-defined and gives rise to an associative product. Recently, Buch–Ravikumar (2012) proved a Pieri rule for OG.n; 2nC1/ th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 53 شماره
صفحات -
تاریخ انتشار 1990